Hitting times, commute times, and cover times for random walks on random hypergraphs
نویسندگان
چکیده
منابع مشابه
The cover times of random walks on random uniform hypergraphs
Random walks in graphs have been applied to various network exploration and network maintenance problems. In some applications, however, it may be more natural, and more accurate, to model the underlying network not as a graph but as a hypergraph, and solutions based on random walks require a notion of random walks in hypergraphs. At each step, a random walk on a hypergraph moves from its curre...
متن کاملCommute times of random walks on trees
In this paper we provide exact formula for the commute times of random walks on spherically symmetric random trees. Using this formula we sharpen some of the results presented in Al-Awadhi et al to the form of equalities rather than inequalities.
متن کاملThe Cover Times of Random Walks on Hypergraphs
Random walks in graphs have been applied to various network exploration and networkmaintenance problems. In some applications, however, it may be more natural, and moreaccurate, to model the underlying network not as a graph but as a hypergraph, and solutionsbased on random walks require a notion of random walks in hypergraphs. While randomwalks in graphs have been extensive...
متن کاملHitting Times for Random Walks with Restarts
The time it takes a random walker in a lattice to reach the origin from another vertex x, has infinite mean. If the walker can restart the walk at x at will, then the minimum expected hitting time γ(x, 0) (minimized over restarting strategies) is finite; it was called the “grade” of x by Dumitriu, Tetali and Winkler. They showed that, in a more general setting, the grade (a variant of the “Gitt...
متن کاملLectures 16-17: Random Walks on Graphs 1.1 Hitting times and Cover Times
Let G (V, E) be an undirected graph. The random walk on G is a Markov chain on V that, at each time step, moves to a uniformly random neighbor of the current vertex. Ffsor x ∈ V , use dx to denote the degree of vertex x. Then more formally, random walk on G is the following process {Xt}. We start at at some node X0 v0 ∈ V . Then if Xt v, we put Xt+1 w with probability 1/dv for every neighbor w ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2019
ISSN: 0167-7152
DOI: 10.1016/j.spl.2019.06.011